The On-Line Encyclopedia of Integer Sequences

نویسنده

  • N. J. A. Sloane
چکیده

We all recognize 0, 1, 1, 2, 3, 5, 8, 13, . . . but what about 1, 2, 4, 6, 3, 9, 12, 8, 10, 5, 15, . . .? If you come across a number sequence and want to know if it has been studied before, there is only one place to look, the On-Line Encyclopedia of Integer Sequences (or OEIS). Now in its 49th year, the OEIS contains over 220,000 sequences and 20,000 new entries are added each year. This article will briefly describe the OEIS and its history. It will also discuss some sequences generated by recurrences that are less familiar than Fibonacci’s, due to Greg Back and Mihai Caragiu, Reed Kelly, Jonathan Ayres, Dion Gijswijt, and Jan Ritsema van Eck.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The On-Line Encyclopedia of Integer Sequences, Volume 50, Number 8

912 NOTICES OF THE AMS VOLUME 50, NUMBER 8 This article gives a brief introduction to the On-Line Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs to generate the sequence, references, links to releva...

متن کامل

On the sequence A085642

We prove the conjecture by Vladeta Jovovic on the sequence A085642 in Sloane’s On-Line Encyclopedia of Integer Sequences.

متن کامل

Maximum Product Over Partitions Into Distinct Parts

We establish an explicit formula for the maximum value of the product of parts for partitions of a positive integer into distinct parts (sequence A034893 in the On-Line Encyclopedia of Integer Sequences).

متن کامل

Blocks in cycles and k-commuting permutations

We introduce and study k-commuting permutations. One of our main results is a characterization of permutations that k-commute with a given permutation. Using this characterization, we obtain formulas for the number of permutations that k-commute with a permutation [Formula: see text], for some cycle types of [Formula: see text]. Our enumerative results are related with integer sequences in "The...

متن کامل

Integer Sequences Connected with Extensions of the Bell Polynomials

The Encyclopedia of Integer Sequences includes some sequences that are connected with the Bell numbers and that have a particular combinatorial meaning. In this article, we find a general meaning for framing sequences, including the above mentioned ones. Furthermore, by using Laguerre-type derivatives, we derive the Laguerre-type Bell numbers of higher order, showing, as a by-product, that it i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994